Random Discrete Structures: Approximations and Applications
نویسنده
چکیده
The investigators in this discovery grant are: Aihua Xia at http://www.ms.unimelb.edu.au/Personnel/profile.php?PC_id=76 Andrew Barbour at http://user.math.uzh.ch/barbour/ Phil Pollett at http://www.maths.uq.edu.au/~pkp/ Nathan Ross at http://www.ms.unimelb.edu.au/~rossn1/ Malwina Luczak at http://www.maths.qmul.ac.uk/~luczak/ Gesine Reinert at http://www.stats.ox.ac.uk/~reinert/ Adrian Roellin at http://www.stat.nus.edu.sg/~staar/ Erol Pekoz at http://people.bu.edu/pekoz/
منابع مشابه
Continuous Discrete Variable Optimization of Structures Using Approximation Methods
Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...
متن کاملDiscrete Approximations of Generalized Rbsde with Random Terminal Time
The convergence of discrete approximations of generalized reflected backward stochastic differential equations with random terminal time in a general convex domain is studied. Applications to investigation obstacle elliptic problem with Neumann boundary condition for partial differential equations are given.
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملClassification and properties of acyclic discrete phase-type distributions based on geometric and shifted geometric distributions
Acyclic phase-type distributions form a versatile model, serving as approximations to many probability distributions in various circumstances. They exhibit special properties and characteristics that usually make their applications attractive. Compared to acyclic continuous phase-type (ACPH) distributions, acyclic discrete phase-type (ADPH) distributions and their subclasses (ADPH family) have ...
متن کامل